LDPC codes based on Steiner quadruple sys- tems and permutation matrices
نویسندگان
چکیده
An algorithm for generating parity-check matrices of high-rate lowdensity parity-check codes based on permutation matrices and Steiner system S(v, 4, 2) is proposed. The estimations of rate, minimum distance and girth for derived code constructions are presented. The results of simulation of obtained code constructions for an iterative ”belief propagation” (Sum-Product) decoding algorithm, applied in the case of transmission of a code word via a binary channel with an additive Gaussian white noise and BPSK modulation, are presented.
منابع مشابه
Structuredquasi - cyclicLDPCcodeswith girth 18 and column - weight J 3
A class of maximum-girth geometrically structured quasi-cyclic (QC) low-density parity-check (LDPC) codes with columnweight J 3 is presented. The method is based on the slope concept between two circulant permutation matrices and the concept of slope matrices. A LDPC code presented by a mv ×ml parity-check matrix H , consisting of m ×m matrices each of which is either a circulant permutation ma...
متن کاملApproach to the construction of regular low-density parity-check codes from group permutation matrices
In this study, a new method for constructing low-density parity-check (LDPC) codes is presented. This construction is based on permutation matrices which come from a finite abstract group and hence the codes constructed in this manner are called group permutation low-density parity-check (GP-LDPC) codes. A necessary and sufficient condition under which a GP-LDPC code has a cycle, is given and s...
متن کاملColumn Weight Two and Three LDPC Codes with High Rates and Large Girths
In this paper, the concept of the broken diagonal pair in the chess-like square board is used to define some well-structured block designs whose incidence matrices can be considered as the parity-check matrices of some high rate cycle codes with girth 12. Interestingly, the constructed regular cycle codes with row-weights t, 3 ≤ t ≤ 20, t 6= 7, 15, 16, have the best lengths among the known regu...
متن کاملLDPC Codes in the McEliece Cryptosystem
The original McEliece cryptosystem, based on Goppa codes, has two important drawbacks: long keys and low transmission rate. LDPC codes seem natural candidates to overcome such drawbacks, because of their sparse parity-check matrices, that could form the public keys, and the flexibility in transmission rates. Moreover, quasi-cyclic (QC) LDPC codes could permit to further reduce the key length. S...
متن کاملOn the Usage of LDPC Codes in the McEliece Cryptosystem
In this paper, a new variant of the McEliece cryptosystem, based on Low-Density Parity-Check (LDPC) codes, is studied. Random-based techniques allow to design large families of LDPC codes with equivalent error correction capability; therefore, in principle, such codes can substitute Goppa codes, originally used by McEliece in his cryptosystem. Furthermore, Quasi-Cyclic (QC) LDPC codes can be ad...
متن کامل